Stability of Brocard Points of Polygons
نویسندگان
چکیده
A continuous nested sequence of similar triangles converging to the Brocard point of a given triangle is investigated. All these triangles have the same Brocard point. For polygons, the Brocard point need not exist, but there is always a limit object for an analogously defined nested sequence of inner polygons. This limit object is a Brocard point if and only if the inner polygons are all similar to the original polygon. The similarity of two distinct inner polygons already suffices. In that case, all the inner polygons have the same Brocard point.
منابع مشابه
The Rocky Mountain Journal of Mathematics 30(2000), 411-434 STABILITY OF BROCARD POINTS OF POLYGONS
A continuous nested sequence of similar triangles converging to the Brocard point of a given triangle is investigated. All these triangles have the same Brocard point. For polygons, the Brocard point need not exist, but there is always a limit object for an analogously defined nested sequence of inner polygons. This limit object is a Brocard point if and only if the inner polygons are all simil...
متن کاملComplementary Halfspaces and Trigonometric Ceva–brocard Inequalities for Polygons
The product of ratios that equals 1 in Ceva’s Theorem is analyzed in the case of non-concurrent Cevians, for triangles as well as arbitrary convex polygons. A general lemma on complementary systems of inequalities is proved, and used to classify the possible cases of non-concurrent Cevians. In the concurrent case, particular consideration is given to the Brocard configuration defined by equal a...
متن کاملThe Brocard Angle and a Geometrical Gem from Dmitriev and Dynkin
In a celebrated paper on the eigenvalues of special matrices, N. Dmitriev and E. Dynkin formulated and proved a nice geometrical lemma. This lesser-known gem provides a simple proof of the maximal value of the Brocard angle and yields also the solution to some challenging problems from the past few decades. The Brocard points and Brocard angle of a triangle have attracted great attention since ...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کامل